Process Algebra Semantics for Queues
نویسنده
چکیده
An unbounded queue over a finite set of data 1is,,a Q. in -.A defined by an infinite system of guarded equations. The aim of this paper is to show that no finite system of guarded equations is capable of defining Q. This is a revised version of: Process algebra semantics for queues, Mathematical Centre Research Report IW241,, Amst,rdam.,1983.. * present affiliation & correspondence address: of University of Utrecht HeidelbergTaan 2 3=584 CS-.: Utrecht The Netherlands
منابع مشابه
PEPA Queues: Capturing Customer Behaviour in Queueing Networks
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. We present the PEPA Queues formalism, which uses the popular stochastic process algebra PEPA to represent the individual state and behaviour of customers and servers. We offer a formal semantics for PEPA Queues, plus a...
متن کاملFunctorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملA Compositional Petri Net Semantics for SDL
In this paper a compositional high-level Petri net semantics for SDL (Speciication and Description Language) is presented. Emphasis is laid on the modelling of dynamic creation and termination of processes and of procedures { features, which are, for instance, essential for typical client-server systems. In a preliminary paper we have already shown that we are able to usèstate of the art' verii...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملReduction semantics in Markovian process algebra
Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process a...
متن کامل